ABSTRACT
Parallel Surrogate-Assisted Evolutionary Algorithms (P-SAEAs) are based on surrogate-informed reproduction operators to propose new candidates to solve computationally expensive optimization problems. Differently, Parallel Surrogate-Driven Algorithms (P-SDAs) rely on the optimization of a surrogate-informed metric of promisingness to acquire new solutions. The former are promoted to deal with moderately computationally expensive problems while the latter are put forward on very costly problems. This paper investigates the design of hybrid strategies combining the acquisition processes of both P-SAEAs and P-SDAs to retain the best of both categories of methods. The objective is to reach robustness with respect to the computational budgets and parallel scalability. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.